NP-Opt: an optimization framework for NP problems
نویسندگان
چکیده
This paper presents a new object-oriented framework for optimization based on evolutionary computation techniques to address NP-hard problems. At present, the NP-Opt is customized to deal with five classes of problems. The level of code reutilization is high and allows the adaptation to new problems very quickly, just by adding a few new classes to the framework. The structure of the classes and the problems treated are presented, as well as the main characteristics of the genetic and memetic algorithms used.
منابع مشابه
O framework NP-Opt e suas aplicações a problemas de otimização
One of the greatest difficulties in working with combinatorial optimization is that the methods require specific procedures for each problem. Even general purpose methods, like Evolutionary Algorithms, require operators developed specifically for the problems. Suppose, for example, that someone has developed a code to solve Single Machine Scheduling problems. If such person decides to change an...
متن کاملDifference Bounds on the Approximation of NP Optimization Problems
This paper explores the performance of polynomial approximation algorithms to NP-hard optimization problems. The performance of an approximation algorithm is measured as the difference of the solutions provided by the algorithm and the optimal solution. It is shown that no approximation algorithm for the Min Three-Vector Sum problem can guarantee to provide a solution such that |A(I)−OPT (I)| <...
متن کاملApproximation of some NP-hard optimization problems by finite machines, in probability
We introduce a subclass of NP optimization problems which contains some NP-hard problems, e.g., bin covering and bin packing. For each problem in this subclass we prove that with probability tending to 1 (exponentially fast as the number of input items tends to in)nity), the problem is approximable up to any chosen relative error bound ¿ 0 by a deterministic )nite-state machine. More precisely,...
متن کاملAn Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
متن کاملA Categorical Approach to NP-Hard Optimization Problems
Aiming at developing a theoretical framework for the formal study of NP-hard optimization problems, which is built on precise mathematical foundations, we have focused on structural properties of optimization problems related to approximative issue. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity notions, in this work we pr...
متن کامل